On normalizing, non-terminating one-rule string rewriting systems
نویسندگان
چکیده
منابع مشابه
On String Rewriting Systems
String rewriting systems, also known as semi-Thue systems, consist of a set of rules l → r, specifying valid replacements of substrings of strings over a given alphabet. In the case of one single rule, it is an open problem whether there is a system that is neither terminating nor looping. Another open question is the decidability of termination. Difficulties arise especially for non-confluent ...
متن کاملLoops of Superexponential Lengths in One-Rule String Rewriting
Abstract. Loops are the most frequent cause of non-termination in string rewriting. In the general case, non-terminating, non-looping string rewriting systems exist, and the uniform termination problem is undecidable. For rewriting with only one string rewriting rule, it is unknown whether non-terminating, non-looping systems exist and whether uniform termination is decidable. If in the one-rul...
متن کاملSemantics Of Non-Terminating Systems Through Term Rewriting
This thesis is primarily concerned with the algebraic semantics of non-terminating term rewriting systems. The usual semantics for rewrite system is based in interpreting rewrite rules as equations and rewriting as a particular case of equational reasoning. The termination of a rewrite system ensures that every term has a value (normal form). But, in general we cannot guarantee this. The resear...
متن کاملOn Weakly Confluent Monadic String-Rewriting Systems
Madlener, K., P. Narendran, F. Otto and L. Zhang, On weakly confluent monadic string-rewriting systems, Theoretical Computer Science 113 (1993) 119-165. It is investigated as to how far the various decidability results for finite, monadic, and confluent string-rewriting systems can be carried over to the class of finite monadic string-rewriting systems that are only weakly confluent. Here a mon...
متن کاملPeg - Solitaire , String Rewriting Systems
We consider a class of length-preserving string rewriting systems and show that the set of encodings of pairs of strings < s; f > such that f can be derived from s using the rewriting rules can be accepted by nite automata. As a consequence, we show the existence of a linear time algorithm for determining the solvability of a given k n peg-solitaire board, for any xed k. This result is in contr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00167-5